Graffiti.pc: A Variant of Graffiti

نویسنده

  • Ermelinda DeLaViña
چکیده

Graffiti.pc is a new conjecture-making program, whose design was influenced by the well-known conjecture making program, Graffiti. This paper addresses the motivation for developing the new program and a description, which includes a comparison to the program, Graffiti. The subsequent sections describe the form of conjectures and educational applications of Graffiti.pc to undergraduate research in graph theory.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some conjectures of Graffiti.pc on total domination

We limit our discussion to graphs that are simple and finite of order . Although 8 we often identify a graph with its set of vertices, in cases where we need to be K explicit we write . A set of vertices of is said to Z ÐKÑ Q K dominate K provided each vertex of is either in or adjacent to a vertex of . K Q Q The domination number of is the minimum order of a dominating set. A K dominating prov...

متن کامل

Spanning Trees with Many Leaves and Average Distance

In this paper we prove several new lower bounds on the maximum number of leaves of a spanning tree of a graph related to its order, independence number, local independence number, and the maximum order of a bipartite subgraph. These new lower bounds were conjectured by the program Graffiti.pc, a variant of the program Graffiti. We use two of these results to give two partial resolutions of conj...

متن کامل

A Semantic Approach to Urban Graffiti from Semiotics Viewpoint

City is the most complicated and tangible creature of man. There is a critical mutual communicationbetween human and city; and the effect of one’ living environment is beyond question. Graffiti is a new urbanphenomenon, which has drawn attention in light of its connection with protestation culture and street art. Thanks tosymbolism of graffiti, the artists have added mysterious aspects to their...

متن کامل

Graffiti.pc on the total domination number of a tree

The total domination number of a simple, undirected graph G is the minimum cardinality of a subset D of the vertices of G such that each vertex of G is adjacent to some vertex in D. In 2007 Graffiti.pc, a program that makes graph theoretical conjectures, was used to generate conjectures on the total domination number of connected graphs. More recently, the program was used to generate conjectur...

متن کامل

The Design and Construction of an Efficient Model for Teaching Science in Junior High School

Analysis of Desk Graffiti in Karaj High Schools F. Aabedi M. Monaadi, Ph.D. Writing graffiti on the walls and furniture as a means of expressing disappointments, wishes, and ideals is an old habit. From a socio-pathological perspective it may be considered a delinquent act, it is a way of communication between the writer and the readers of the graffiti. To analyze the content ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001